Technical Note—A Note on the Busy Period of anM/G/1 Finite Queue
نویسندگان
چکیده
منابع مشابه
On the Batch Size and the Busy Period in the Finite ’Israeli Queue’
The Israeli Queue is a polling-type system with N groups (queues) and un-limited size batch service, where the next group to be served is the one with the most senior customer. For such a system we derive (i) the mean size of each group, and (ii) the Laplace-Stieltjes Transform and mean of the length of a busy period starting with n ≥ 1 groups. Numerical calculations are presented and the param...
متن کاملError Analysis of the Mean Busy Period of a Queue
The error between the actual value of the mean busy periQ..d and the value estimaled by a common queueing tormula (D;:;: SOl (i-V)) is evaluated. tDenning's addre:'l!l: Department of Compu.ter Sciences, Purdue University, W. Lafayette, IN 41907 USA. KoweJk's addre:iS: FClchbcrcich Inrormatik, Univer:ritut Hamburg. RoUlerbllumschau9ce 07/09, 2000 Hamburg 10, West Gcrmuny.
متن کاملMoment Calculating Algorithm for Busy-period of Discrete-time Finite-capacity M/G/1 Type Queue
In this paper, we propose an algorithm to calculate the higher moments of the busy period length of a discretetime M/G/1 type queue with finite buffer. The queueing model has a level-dependent transition probability matrix. Our algorithm is given as a set of recursive formulas which are derived from the relationship among the generating function matrices of the fundamental period. As an example...
متن کاملOptimization of M G 1 Queue with Vacation (TECHNICAL NOTE)
This paper reports on the minimization of the average waiting time of the customers in the M/G/1 queue with vacation. Explicit formula for the unknown service parameter of a particular customer has been obtained by considering the exhaustive service discipline in the case of multi-user with unlimited service system. Moreover, results in case of partially gated and gated service disciplines unde...
متن کاملProbability Density for Number of Customers Served During the Busy Period of a Finite Auto-Correlated MEP/MEP/1 Queue or Probability Density for Services During the Busy Period of a Finite Auto-Correlated MEP/MEP/1 Queue
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where both the arrivals and service processes can be serially auto-correlated Matrix Exponential Processes and provide a mechanism to compute the expected number of customers served during a finite queue’s busy period. We then show some numeric results by computing the probabilities of serving exactly n c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1975
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.23.6.1179